Matroids with nine elements

We describe the computation of a catalogue containing all matroids with up to nine elements, and present some fundamental data arising from this cataogue. Our computation confirms and extends the results obtained in the 1960s by Blackburn, Crapo and Higgs. The matroids and associated data are stored in an online database, and we give three short examples of the use of this database.Comment: 22 page

The chromatic number and rank of the complements of the Kasami graphs

AbstractWe determine the rank and chromatic number of the complements of all Kasami graphs, some of which form an infinite family of counterexamples to the now disproven rank-coloring conjecture

Maximum size binary matroids with no AG(3,2)-minor are graphic

We prove that the maximum size of a simple binary matroid of rank $r \geq 5$ with no AG(3,2)-minor is $\binom{r+1}{2}$ and characterise those matroids achieving this bound. When $r \geq 6$, the graphic matroid $M(K_{r+1})$ is the unique matroid meeting the bound, but there are a handful of smaller examples. In addition, we determine the size function for non-regular simple binary matroids with no AG(3,2)-minor and characterise the matroids of maximum size for each rank

The 2-rotational Steiner triple systems of order 25

AbstractIn this paper, we enumerate the 2-rotational Steiner triple systems of order 25. There are exactly 140 pairwise non-isomorphic such designs. All these designs have full automorphism groups of order 12. We also investigate the existence of subsystems and quadrilaterals in these designs